منابع مشابه
The Common-Neighbourhood of a Graph
Abstract: The most widely used and well-known vulnerability measures of a connected graph are based on the neighbourhood concept. It takes into account neighbour-integrity, edge-integrity and accessibility number. In this work we define and examine common-neighbourhood of a connected graph as a new global connectivity measure. Our measure examines the neighbourhoods of all pairs of vertices of ...
متن کاملjohn steinbeck: friend of the american common man
in his last years of life americans had almost forgotton steinbeck, and those who had not, occasionally criticized him for supporting and praising the u. s. military intervention in the vietnam war. althought ateinbeck incorporates different themes into his works, each one bears many signs of his concern and sympathy for america and the american common people in particular. steinbecks to a god ...
15 صفحه اولThe neighbourhood polynomial of a graph
We examine neighbourhood polynomials, which are generating functions for the number of faces of each cardinality in the neighbourhood complex of a graph. We provide explicit polynomials for hypercubes, for graphs not containing a four-cycle and for the graphs resulting from joins and Cartesian products. We also show that the closure of the roots are dense in the complex plane except possibly in...
متن کاملThe Common Neighborhood Graph and Its Energy
Let $G$ be a simple graph with vertex set ${v_1,v_2,ldots,v_n}$. The common neighborhood graph (congraph) of $G$, denoted by $con(G)$, is the graph with vertex set ${v_1,v_2,ldots,v_n}$, in which two vertices are adjacent if and only they have at least one common neighbor in the graph $G$. The basic properties of $con(G)$ and of its energy are established.
متن کاملCommon Neighborhood Graph
Let G be a simple graph with vertex set {v1, v2, … , vn}. The common neighborhood graph of G, denoted by con(G), is a graph with vertex set {v1, v2, … , vn}, in which two vertices are adjacent if and only if they have at least one common neighbor in the graph G. In this paper, we compute the common neighborhood of some composite graphs. In continue, we investigate the relation between hamiltoni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Boletim da Sociedade Paranaense de Matemática
سال: 2017
ISSN: 2175-1188,0037-8712
DOI: 10.5269/bspm.v35i1.22464